Asynchronous Multipliers with Variable-Delay Counters
نویسندگان
چکیده
Although multiplication is an intensely studied arithmetic operation and many fast algorithms and implementations are avalaible, it still represents one of the major bottlenecks of many digital systems that require intensive and fast computations. This paper presents a novel design approach based on the well-known Baugh and Wooley algorithm, particularly appealing for asynchronous implementations and that may be easily mapped into a VLSI circuit. This technique has been applied to the design of a high-speed variable-delay multiplier that resulted to be faster than other synchronous and asynchronous implementations.
منابع مشابه
Design and implementation of an Asynchronous Controller for FPGA Based Asynchronous Systems
In a clause of combinational circuits, the throughput can be increased, without (wave) pipelining, by introducing data dependent delay feature thus avoiding the worst case delay. That is, in circuits like multipliers and adders which are the basic building blocks of any DSP system; the processing delay can be varied according to the magnitude of the input data. This makes the circuit asynchrono...
متن کاملApproximate Early Output Asynchronous Adders Based on Dual-Rail Data Encoding and 4-Phase Return-to-Zero and Return-to-One Handshaking
Approximate computing is emerging as an alternative to accurate computing due to its potential for realizing digital circuits and systems with low power dissipation, less critical path delay, and less area occupancy for an acceptable trade-off in the accuracy of results. In the domain of computer arithmetic, several approximate adders and multipliers have been designed and their potential have ...
متن کاملParallel Counter Formulation using a Generator Polynomial Expansion
Parallel counters have been studied for several decades as a component in fast multipliers and multioperand adder circuits. Efficient design of these functional units can produce fast & efficient multipliers and signal processors. Proposed in this paper is a GF(2) generator polynomial expansion that can be used to specify parallel counters. The mathematical formalism provides a general way of d...
متن کاملPerformance Comparison of Fast Multipliers Implemented on Variable Precision Floating Point Multiplication Algorithm
The multiplication is the basic arithmetic operation in any typical processor. The multiplication process requires more hardware resources and processing time when compared with addition and subtraction. The accuracy of a multiplication mostly relies on the precision of the multiplication; a variable precision multiplier will have more accuracy than single or double precision multipliers. In th...
متن کاملRecent Progress in Field Programmable Logic
Field-programmable logic started out as glue logic between Òreal ICs.Ó Over the past decade, however, progress in IC technology has made it possible to implement ÒrealÓ functions in FPGAs. Now, bigger and faster FPGAs are becoming system platforms that combine several ÒrealÓ systems functions on a single chip. even microprocessors and memories. ÒBiggerÓ means several million gates, and up to a ...
متن کامل